Report on Private Information Retrieval over Unsynchronized Databases
نویسندگان
چکیده
There are many challenges concerning online privacy. Private information retrieval (PIR) tries to find solution to following problem. Server has a database of n records and client wants to retrieve w-th record without revealing w to the server. PIR schemes can be described for single-server and multi-server case (where each server holds identical copy of database). Current report reviews a multi-server scheme proposed by Fanti and Ramchandran [1]. They adapt a previously described scheme [2] by adding ability to handle some number of unsynchronized records. Scheme also allows some servers to collaborate without discovering w.
منابع مشابه
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
We consider the problem of single-round private information retrieval (PIR) from N replicated databases. We consider the case when B databases are outdated (unsynchronized), or even worse, adversarial (Byzantine), and therefore, can return incorrect answers. In the PIR problem with Byzantine databases (BPIR), a user wishes to retrieve a specific message from a set of M messages with zero-error,...
متن کاملRelational-Complete Private Information Retrieval
We show how relational algebra queries can be processed over relational databases encoded for private information retrieval. In particular, we illustrate how each of the constructs for relational algebra can be compiled into an online stream of private information retrieval requests. This brings relational-complete query capabilities to traditional private information retrieval schemes, which g...
متن کاملA T-private K-database Private Information Retrieval Scheme
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated databases. The scheme is information-theoretically secure against coalitions of databases of size t k ? 1. It improves the communication complexity of the scheme described in 12] for coalitions of ...
متن کاملUpper Bound on Communication Complexity of Private Information Retrieval
We construct a scheme for private information retrieval with k databases and communication complexity O(n 1=(2k?1)).
متن کاملPrivate Information Retrieval with Partially Known Private Side Information
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user of cache-size M messages possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching pha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017